Exploring the conformational space of protein side chains using dead-end elimination and the A* algorithm.
نویسندگان
چکیده
We describe an algorithm which enables us to search the conformational space of the side chains of a protein to identify the global minimum energy combination of side chain conformations as well as all other conformations within a specified energy cutoff of the global energy minimum. The program is used to explore the side chain conformational energy surface of a number of proteins, to investigate how this surface varies with the energy model used to describe the interactions within the system and the rotamer library. Enumeration of the rotamer combinations enables us to directly evaluate the partition function, and thus calculate the side chain contribution to the conformational entropy of the folded protein. An investigation of these conformations and the relationships between them shows that most of the conformations near to the global energy minimum arise from changes in side chain conformations that are essentially independent; very few result from a concerted change in conformation of two or more residues. Some of the limitations of the approach are discussed.
منابع مشابه
Theoretical and algorithmical optimization of the dead-end elimination theorem.
The dead-end elimination theorem has proved to be a powerful method to reduce the theoretically accessible conformational space when modeling protein side chains by using a rotameric representation of possible conformations. In this work, theoretical details about variants to the original criterion are discussed. We also provide information on how the equations can be algorithmically implemente...
متن کاملSide Chain-Positioning as an Integer Programming Problem
An important aspect of homology modeling and protein design algorithms is the correct positioning of protein side chains on a fixed backbone. Homology modeling methods are necessary to complement large scale structural genomics projects. Recently it has been shown that in automatic protein design it is of the uttermost importance to find the global solution to the side chain positioning problem...
متن کاملConformational splitting: A more powerful criterion for dead-end elimination
Dead-end elimination (DEE) is a powerful theorem for selecting optimal protein side-chain orientations from a large set of discrete conformations. The present work describes a new approach to dead-end elimination that effectively splits conformational space into partitions to more efficiently eliminate dead-ending rotamers. Split DEE makes it possible to complete protein design calculations tha...
متن کاملProtein Design Using Continuous Rotamers
UNLABELLED Optimizing amino acid conformation and identity is a central problem in computational protein design. Protein design algorithms must allow realistic protein flexibility to occur during this optimization, or they may fail to find the best sequence with the lowest energy. Most design algorithms implement side-chain flexibility by allowing the side chains to move between a small set of ...
متن کاملFitmunk: improving protein structures by accurate, automatic modeling of side-chain conformations
Improvements in crystallographic hardware and software have allowed automated structure-solution pipelines to approach a near-`one-click' experience for the initial determination of macromolecular structures. However, in many cases the resulting initial model requires a laborious, iterative process of refinement and validation. A new method has been developed for the automatic modeling of side-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Proteins
دوره 33 2 شماره
صفحات -
تاریخ انتشار 1998